Interestingness-Based Interval Merger for Numeric Association Rules
نویسندگان
چکیده
We present aa algorithm for mining association rules from relational tables containing numeric and categorical attributes. The approach is to merge adjacent intervals of numeric values, in a bottom-up manner, on the basis of maximizing the interestingness of a set of association rules. A modification of the B-tree is adopted for performing this task efficiently. The algorithm takes O(kN) I/O time, where k is the number of attributes and N is the number of rows in the table. We evaluate the effectiveness of producing good intervals.
منابع مشابه
Numeric Multi-Objective Rule Mining Using Simulated Annealing Algorithm
Abstract as a single objective one. Measures like support, confidence and other interestingness criteria which are used for evaluating a rule, can be thought of as different objectives of association rule mining problem. Support count is the number of records, which satisfies all the conditions that exist in the rule. This objective represents the accuracy of the rules extracted from the da...
متن کاملRanking objective interestingness measures with sensitivity values
In this paper, we propose a new approach to evaluate the behavior of objective interestingness measures on association rules. The objective interestingness measures are ranked according to the most significant interestingness interval calculated from an inversely cumulative distribution. The sensitivity values are determined by this interval in observing the rules having the highest interesting...
متن کاملSelecting a Right Interestingness Measure for Rare Association Rules
In the literature, the properties of several interestingness measures have been analyzed and a framework has been proposed for selecting a right interestingness measure for extracting association rules. As rare association rules contain useful knowledge, researchers are making efforts to investigate efficient approaches to extract the same. In this paper, we make an effort to analyze the proper...
متن کاملInterestingness and Pruning of Mined Patterns
We study the following question: when can a mined pattern, which may be an association, a correlation, ratio rule, or any other, be regarded as interesting? Previous approaches to answering this question have been largely numeric. Speciically, we show that the presence of some rules may make others redundant, and therefore uninteresting. We articulate these principles and formalize them in the ...
متن کاملInterestingness Measures for Rare Association Rules and Periodic-Frequent Patterns
Data mining is the process of discovering significant and potentially useful knowledge in the form of patterns from the data. As a result, the notion of interestingness is very important for extracting useful knowledge patterns. Numerous interestingness measures have been discussed in the literature to assess the interestingness of a knowledge pattern. In this thesis, we focus on selecting a ri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998